Riesz Bases of Splines and Regularized Splines with Multiple Knots
نویسندگان
چکیده
منابع مشابه
Splines, Knots, and Penalties
Penalized splines have gained much popularity as a flexible tool for smoothing and semi-parametric models. Two approaches have been advocated: 1) use a B-spline basis, equally-spaced knots and difference penalties (Eilers and Marx, 1996) and 2) use truncated power functions, knots based on quantiles of the independent variable and a ridge penalty (Ruppert, Wand and Carroll, 2003). We compare th...
متن کاملGood approximation by splines with variable knots
Here, t1, . . . , tN are the knots or joints of s ∈ S k π, and their multiplicity, i.e., equality among two or more of these, indicates reduced smoothness at that knot location in the usual way. Best approximation to f by elements of S π is quite well understood for a variety of norms since, after all, S π is a linear space. It seems practically more important and theoretically more interesting...
متن کاملFractional Splines , Wavelet Bases
The purpose of this presentation is to describe a recent family of basis functions—the fractional B-splines—which appear to be intimately connected to fractional calculus. Among other properties, we show that they are the convolution kernels that link the discrete (finite differences) and continuous (derivatives) fractional differentiation operators. We also provide simple closed forms for the ...
متن کاملOn monotone and convex approximation by splines with free knots
We prove that the degree of shape preserving free knot spline approximation in L p a; b], 0 < p 1 is essentially the same as that of the non-constrained case. This is in sharp contrast to the well known phenomenon we have in shape preserving approximation by splines with equidistant knots and by polynomials. The results obtained are valid both for piecewise polynomials and for smooth splines wi...
متن کاملAlgorithms for Piecewise Polynomials and Splines with Free Knots
We describe an algorithm for computing points o = io < ii < • • • < xjt < Zfc+i = b which solve certain nonlinear systems d(z,_i,xt) = d(i,,x,+i), i = 1,... ,fc. In contrast to Newton-type methods, the algorithm converges when starting with arbitrary points. The method is applied to compute best piecewise polynomial approximations with free knots. The advantage is that in the starting phase onl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Approximation Theory
سال: 1996
ISSN: 0021-9045
DOI: 10.1006/jath.1996.0108